As described above, the Route node evaluates an expression, the result of which is then cast as a Boolean to produce a true or false test condition. 如上所述,Route节点对表达式求值,结果将强制转换为布尔值,以生成真或假的测试条件。
A class of Boolean functions are constructed by mapping, a necessary and sufficient condition is for them to be k-quasi Bent functions using cyclic Walsh spectrum of Boolean functions, and some methods satisfying the condition by using properties of the coset are given. 通过映射构造了一类布尔函数,利用布尔函数循环Walsh谱的方法给出了该类布尔函数是k阶拟Bent函数的充分必要条件,并利用集合性质给出了满足该条件的方法。
In the paper it has been proved that the rough equality relation is a lattice congruence on Boolean algebra P ( U), and the sufficient and necessary condition has been given that an equivalent relation ρ on P ( U) is a rough equality relation. 讨论了粗等价的性质,证明了粗相等关系是Boolean代数(2U,∩,∪,~)上的同余关系,给出了2U上的一个等价关系是粗相等的刻画。
A series of probability expressions of m th order Walsh spectrum of Boolean functions is given. The identified condition of a Boolean function and a m th order Boolean function are independent is also given. 给出了布尔函数的m阶Walsh谱的概率表达式及布尔函数与一个m阶布尔函数相互独立的判别条件;
The result of the experiment shows that the maximum entropy is better than the decision tree on either Boolean value condition or adding the frequency of words. 在上述得到的特征集合下,对目前应用较多的决策树模型和最大熵模型,分别进行了特征词的二值情况下和加入特征词的频率信息的情况下的中文文本分类实验。
This paper introduces the concept of primitive infinite Boolean matrices and proposes a sufficient and necessary condition for the symmetric infinite Boolean matrices. Finally a calculation formula of the primitive exponent is demonstrated. 引入了本原无限布尔方阵的概念,给出了对称无限布尔方阵为本原阵的一个充分必要条件,最后给出了对称本原无限布尔方阵的本原指数的一个计算公式。
According to the different feature sets, this paper carries out some experiments in text categorization respectively under Boolean value condition and under adding the frequency of words, and puts forward the system flow of text categorization, evaluation methods and experiment results. 据不同的特征集合,分别进行了基于特征词布尔值和基于特征词的词频的中文文本分类实验,提出了文本分类系统流程,并给出了评估方法和实验结果。